Ben‐Sasson, Eli: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

[IEEE 2014 IEEE Symposium on Security and Privacy (SP) - San Jose, CA (2014.5.18-2014.5.21)] 2014 IEEE Symposium on Security and Privacy - Zerocash: Decentralized Anonymous Payments from Bitcoin

Ben Sasson, Eli, Chiesa, Alessandro, Garman, Christina, Green, Matthew, Miers, Ian, Tromer, Eran, Virza, Madars

Year:

2014

Language:

english

File:

PDF, 674 KB

english, 2014

2

[IEEE 2015 IEEE Symposium on Security and Privacy (SP) - San Jose, CA, USA (2015.5.17-2015.5.21)] 2015 IEEE Symposium on Security and Privacy - Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Ben-Sasson, Eli, Chiesa, Alessandro, Green, Matthew, Tromer, Eran, Virza, Madars

Year:

2015

Language:

english

File:

PDF, 537 KB

english, 2015

3

[IEEE 2015 IEEE Symposium on Security and Privacy (SP) - San Jose, CA, USA (2015.5.17-2015.5.21)] 2015 IEEE Symposium on Security and Privacy - Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Ben-Sasson, Eli, Chiesa, Alessandro, Green, Matthew, Tromer, Eran, Virza, Madars

Year:

2015

File:

PDF, 537 KB

2015

4

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

Ben‐Sasson, Eli, Goldreich, Oded, Harsha, Prahladh, Sudan, Madhu, Vadhan, Salil

Journal:

SIAM Journal on Computing

Year:

2006

Language:

english

File:

PDF, 781 KB

english, 2006

5

Hard examples for the bounded depth Frege proof system

Journal:

Computational Complexity

Year:

2002

Language:

english

File:

PDF, 297 KB

english, 2002

6

Random Cnf’s are Hard for the Polynomial Calculus

Eli Ben-Sasson, Russell Impagliazzo

Journal:

Computational Complexity

Year:

2010

Language:

english

File:

PDF, 457 KB

english, 2010

7

[IEEE 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2008.10.25-2008.10.28)] 2008 49th Annual IEEE Symposium on Foundations of Computer Science - Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution

Ben-Sasson, Eli, Nordström, Jakob

Year:

2008

Language:

english

File:

PDF, 347 KB

english, 2008

8

[ACM Press the thirty-second annual ACM symposium - Portland, Oregon, United States (2000.05.21-2000.05.23)] Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 - Space complexity in propositional calculus

Alekhnovich, Michael, Ben-Sasson, Eli, A., Alexander, Wigderson, Avi

Year:

2000

Language:

english

File:

PDF, 1.05 MB

english, 2000

9

[ACM Press the thiry-fourth annual ACM symposium - Montreal, Quebec, Canada (2002.05.19-2002.05.21)] Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 - Size space tradeoffs for resolution

Ben-Sasson, Eli

Year:

2002

Language:

english

File:

PDF, 233 KB

english, 2002

10

[IEEE 2011 IEEE Annual Conference on Computational Complexity (CCC) - San Jose, CA, USA (2011.06.8-2011.06.11)] 2011 IEEE 26th Annual Conference on Computational Complexity - Symmetric LDPC Codes are not Necessarily Locally Testable

Ben-Sasson, Eli, Maatouk, Ghid, Shpilka, Amir, Sudan, Madhu

Year:

2011

Language:

english

File:

PDF, 311 KB

english, 2011

11

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Locally Testable Codes Require Redundant Testers

Ben-Sasson, Eli, Guruswami, Venkatesan, Kaufman, Tali, Sudan, Madhu, Viderman, Michael

Year:

2009

Language:

english

File:

PDF, 328 KB

english, 2009

12

The relationship between usersâ technology approaches and experiences in a child development mobile application

Ben-Sasson, Ayelet, Ben-Sasson, Eli, Jacobs, Kayla, Malinovitch, Rotem

Journal:

Health and Technology

Year:

2020

File:

PDF, 949 KB

2020

13

Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs

Alekhnovich, Mikhail, Ben‐Sasson, Eli

Journal:

SIAM Journal on Computing

Year:

2007

Language:

english

File:

PDF, 261 KB

english, 2007

14

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Ben-Sasson, Eli, Lovett, Shachar, Ron-Zewi, Noga

Journal:

Journal of the ACM

Year:

2014

Language:

english

File:

PDF, 181 KB

english, 2014

15

[IEEE 2015 IEEE International Symposium on Information Theory (ISIT) - Hong Kong, Hong Kong (2015.6.14-2015.6.19)] 2015 IEEE International Symposium on Information Theory (ISIT) - Subspace polynomials and cyclic subspace codes

Ben-Sasson, Eli, Etzion, Tuvi, Gabizon, Ariel, Raviv, Netanel

Year:

2015

Language:

english

File:

PDF, 211 KB

english, 2015

16

[ACM Press the 45th annual ACM symposium - Palo Alto, California, USA (2013.06.01-2013.06.04)] Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 - A new family of locally correctable codes based on degree-lifted algebraic geometry codes

Ben-Sasson, Eli, Gabizon, Ariel, Kaplan, Yohay, Kopparty, Swastik, Saraf, Shubangi

Year:

2013

Language:

english

File:

PDF, 498 KB

english, 2013

17

[ACM Press the thirty-fifth ACM symposium - San Diego, CA, USA (2003.06.09-2003.06.11)] Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 - Some 3CNF properties are hard to test

Ben-Sasson, Eli, Harsha, Prahladh, Raskhodnikova, Sofya

Year:

2003

Language:

english

File:

PDF, 337 KB

english, 2003

18

[ACM Press the thirty-seventh annual ACM symposium - Baltimore, MD, USA (2005.05.22-2005.05.24)] Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 - Simple PCPs with poly-log rate and query complexity

Ben-Sasson, Eli, Sudan, Madhu

Year:

2005

Language:

english

File:

PDF, 292 KB

english, 2005

19

Robust locally testable codes and products of codes

Eli Ben-Sasson, Madhu Sudan

Journal:

Random Structures & Algorithms

Year:

2006

Language:

english

File:

PDF, 178 KB

english, 2006

20

Space Complexity in Propositional Calculus

Alekhnovich, Michael, Ben-Sasson, Eli, Razborov, Alexander A., Wigderson, Avi

Journal:

SIAM Journal on Computing

Year:

2002

Language:

english

File:

PDF, 311 KB

english, 2002

21

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Sparse Affine-Invariant Linear Codes Are Locally Testable

Ben-Sasson, Eli, Ron-Zewi, Noga, Sudan, Madhu

Year:

2012

Language:

english

File:

PDF, 269 KB

english, 2012

22

Short proofs are narrow---resolution made simple

Ben-Sasson, Eli, Wigderson, Avi

Journal:

Journal of the ACM

Year:

2001

Language:

english

File:

PDF, 167 KB

english, 2001

23

Affine Dispersers from Subspace Polynomials

Ben-Sasson, Eli, Kopparty, Swastik

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 429 KB

english, 2012

24

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Robust pcps of proximity, shorter pcps and applications to coding

Ben-Sasson, Eli, Goldreich, Oded, Harsha, Prahladh, Sudan, Madhu, Vadhan, Salil

Year:

2004

Language:

english

File:

PDF, 220 KB

english, 2004

25

Near Optimal Separation Of Tree-Like And General Resolution

Eli Ben-Sasson*, Russell Impagliazzo†, Avi Wigderson‡

Journal:

Year:

2004

Language:

english

File:

PDF, 278 KB

english, 2004

26

Lower bounds for bounded depth Frege proofs via Pudlák-Buss games

Ben-Sasson, Eli, Harsha, Prahladh

Journal:

ACM Transactions on Computational Logic

Year:

2010

Language:

english

File:

PDF, 169 KB

english, 2010

27

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - An Additive Combinatorics Approach Relating Rank to Communication Complexity

Ben-Sasson, Eli, Lovett, Shachar, Ron-Zewi, Noga

Year:

2012

Language:

english

File:

PDF, 288 KB

english, 2012

28

From Affine to Two-Source Extractors via Approximate Duality

Ben-Sasson, Eli, Ron-Zewi, Noga

Journal:

SIAM Journal on Computing

Year:

2015

Language:

english

File:

PDF, 348 KB

english, 2015

29

Antigen-specific murine T-cell lymphomas: Functional heterogenicity

Yehudith Azar, Paula Eidelsztein, Eitan Yefenof, Evelyne Chriqui, Aviva Katz-Gross, Eli Kedar, Shlomo Zalman Ben-Sasson

Journal:

Cellular Immunology

Year:

1981

Language:

english

File:

PDF, 465 KB

english, 1981

30

Composition of semi-LTCs by two-wise tensor products

Ben-Sasson, Eli, Viderman, Michael

Journal:

Computational Complexity

Year:

2015

Language:

english

File:

PDF, 504 KB

english, 2015

31

[ACM Press the 45th annual ACM symposium - Palo Alto, California, USA (2013.06.01-2013.06.04)] Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 - On the concrete efficiency of probabilistically-checkable proofs

Ben-Sasson, Eli, Chiesa, Alessandro, Genkin, Daniel, Tromer, Eran

Year:

2013

Language:

english

File:

PDF, 538 KB

english, 2013

32

[ACM Press the thirty-fifth ACM symposium - San Diego, CA, USA (2003.06.09-2003.06.11)] Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 - Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Ben-Sasson, Eli, Sudan, Madhu, Vadhan, Salil, Wigderson, Avi

Year:

2003

Language:

english

File:

PDF, 288 KB

english, 2003

33

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - From affine to two-source extractors via approximate duality

Zewi, Noga, Ben-Sasson, Eli

Year:

2011

Language:

english

File:

PDF, 550 KB

english, 2011

34

A combinatorial characterization of smooth LTCs and applications

Ben-Sasson, Eli, Viderman, Michael

Journal:

Random Structures & Algorithms

Year:

2016

Language:

english

File:

PDF, 237 KB

english, 2016

35

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Ben-Sasson, Eli, Kaplan, Yohay, Kopparty, Swastik, Meir, Or, Stichtenoth, Henning

Year:

2013

Language:

english

File:

PDF, 267 KB

english, 2013

36

Size-Space Tradeoffs for Resolution

Ben-Sasson, Eli

Journal:

SIAM Journal on Computing

Year:

2009

Language:

english

File:

PDF, 230 KB

english, 2009

37

Some 3CNF Properties Are Hard to Test

Ben-Sasson, Eli, Harsha, Prahladh, Raskhodnikova, Sofya

Journal:

SIAM Journal on Computing

Year:

2005

Language:

english

File:

PDF, 248 KB

english, 2005

38

[ACM Press the 41st annual ACM symposium - Bethesda, MD, USA (2009.05.31-2009.06.02)] Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 - Affine dispersers from subspace polynomials

Ben-Sasson, Eli, Kopparty, Swastik

Year:

2009

Language:

english

File:

PDF, 519 KB

english, 2009

39

[ACM Press the 2016 International Conference - Istanbul, Turkey (2016.06.01-2016.06.03)] Proceedings of the 2016 International Conference on Supercomputing - ICS '16 - Fast Multiplication in Binary Fields on GPUs via Register Cache

Ben-Sasson, Eli, Hamilis, Matan, Silberstein, Mark, Tromer, Eran

Year:

2016

Language:

english

File:

PDF, 517 KB

english, 2016

40

[IEEE 2011 IEEE Annual Conference on Computational Complexity (CCC) - San Jose, CA, USA (2011.06.8-2011.06.11)] 2011 IEEE 26th Annual Conference on Computational Complexity - Towards Lower Bounds on Locally Testable Codes via Density Arguments

Ben-Sasson, Eli, Viderman, Michael

Year:

2011

Language:

english

File:

PDF, 282 KB

english, 2011

41

Subspace Polynomials and Cyclic Subspace Codes

Ben-Sasson, Eli, Etzion, Tuvi, Gabizon, Ariel, Raviv, Netanel

Journal:

IEEE Transactions on Information Theory

Year:

2016

Language:

english

File:

PDF, 229 KB

english, 2016

42

Space complexity of random formulae in resolution

Eli Ben-Sasson, Nicola Galesi

Journal:

Random Structures & Algorithms

Year:

2003

Language:

english

File:

PDF, 158 KB

english, 2003

43

Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011)

Ben-Sasson, Eli, Ostrovsky, Rafail

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 38 KB

english, 2014

44

Sound 3-Query PCPPs Are Long

Ben-Sasson, Eli, Harsha, Prahladh, Lachish, Oded, Matsliah, Arie

Journal:

ACM Transactions on Computation Theory

Year:

2009

Language:

english

File:

PDF, 400 KB

english, 2009

45

[ACM Press the thirty-first annual ACM symposium - Atlanta, Georgia, United States (1999.05.01-1999.05.04)] Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 - Short proofs are narrow---resolution made simple

Ben-Sasson, Eli, Wigderson, Avi

Year:

1999

Language:

english

File:

PDF, 874 KB

english, 1999

46

Pseudorandom Generators in Propositional Proof Complexity

Alekhnovich, Michael, Ben-Sasson, Eli, Razborov, Alexander A., Wigderson, Avi

Journal:

SIAM Journal on Computing

Year:

2004

Language:

english

File:

PDF, 283 KB

english, 2004

47

[ACM Press the 4th conference - Berkeley, California, USA (2013.01.09-2013.01.12)] Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13 - Fast reductions from RAMs to delegatable succinct constraint satisfaction problems

Ben-Sasson, Eli, Chiesa, Alessandro, Genkin, Daniel, Tromer, Eran

Year:

2013

Language:

english

File:

PDF, 557 KB

english, 2013

48

[ACM Press the thiry-fourth annual ACM symposium - Montreal, Quebec, Canada (2002.05.19-2002.05.21)] Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 - Hard examples for bounded depth frege

Ben-Sasson, Eli

Year:

2002

Language:

english

File:

PDF, 279 KB

english, 2002

49

Towards lower bounds on locally testable codes via density arguments

Ben-Sasson, Eli, Viderman, Michael

Journal:

Computational Complexity

Year:

2012

Language:

english

File:

PDF, 498 KB

english, 2012

50

Sparse affine-invariant linear codes are locally testable

Ben-Sasson, Eli, Ron-Zewi, Noga, Sudan, Madhu

Journal:

Computational Complexity

Year:

2017

Language:

english

File:

PDF, 578 KB

english, 2017

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски